Sequential Completeness of Inductive Limits
نویسندگان
چکیده
A regular inductive limit of sequentially complete spaces is sequentially complete. For the converse of this theorem we have a weaker result: if indEn is sequentially complete inductive limit, and each constituent space En is closed in indEn, then indEn is α-regular.
منابع مشابه
The incompleteness of weak duals
1. Incompleteness of weak duals of reasonable spaces 2. Appendix: locally-convex limits and colimits 3. Appendix: ubiquity of quasi-completeness The point here is to prove that the weak duals of reasonable topological vector spaces, such as infinite-dimensional Hilbert, Banach, or Fréchet spaces, are not complete. That is, in these weak duals there are Cauchy nets which do not converge. Happily...
متن کاملOn Sequentially Retractive Inductive Limits
Every locally complete inductive limit of sequentially complete locally convex spaces , which satisfies Retakh's condition (M) is regular, sequentially complete and sequentially retractive. A quasiconverse for this theorem and a criterion for sequential retractivity of inductive limits of webbed spaces are given.
متن کاملOn Kernel Theorems
A convenient technique for proving kernel theorems for (LF)spaces (countable inductive limits of Fréchet spaces)is developed. The proposed approach is based on introducing a suitable modification of the functor of the completed inductive topological tensor product. Using such modified tensor products makes it possible to prove kernel theorems without assuming the completeness of the considered ...
متن کاملLimits in modified categories of interest
We firstly prove the completeness of the category of crossed modules in a modified category of interest. Afterwards, we define pullback crossed modules and pullback cat objects that are both obtained by pullback diagrams with extra structures on certain arrows. These constructions unify many corresponding results for the cases of groups, commutative algebras and can also be adapted to ...
متن کاملAn Inductive Learning Algorithm with a Partial Completeness and Consistence via a Modified Set Covering Problem
We present an inductive learning algorithm that allows for a partial completeness and consistence, i.e. that derives classification rules correctly describing, e.g, most of the examples belonging to a class and not describing most of the examples not belonging to this class. The problem is represented as a modification of the set covering problem that is solved by a greedy algorithm. The approa...
متن کامل